The universe of propositional approximations
نویسندگان
چکیده
منابع مشابه
The universe of propositional approximations
The idea of approximate entailment has been proposed by Schaerf and Cadoli [Tractable reasoning via approximation, Artif. Intell. 74(2) (1995) 249–310] as a way of modelling the reasoning of an agent with limited resources. In that framework, a family of logics, parameterised by a set of propositional letters, approximates classical logic as the size of the set increases. The original proposal ...
متن کاملElliptic Approximations of Propositional Formulae
A propositional formula can be approximated by a concave quadratic function. This approximation is obtained as a second order Taylor expansion of a convex smooth model. It is shown that in the 3-SAT case, the involved parameters can be set to such values that yield optimal discriminative properties. Two concentric (generally elliptic) quadratic convex regions are established, the inner one cont...
متن کاملThe Zeldovich & Adhesion approximations and applications to the local universe
The Zeldovich approximation (ZA) predicts the formation of a web of singularities. While these singularities may only exist in the most formal interpretation of the ZA, they provide a powerful tool for the analysis of initial conditions. We present a novel method to find the skeleton of the resulting cosmic web based on singularities in the primordial deformation tensor and its higher order der...
متن کاملA Proof Theory for Tractable Approximations of Propositional Reasoning
This paper proposes an uniform framework for the proof theory of tractable approximations of propositional reasoning. The key idea is the introduction of approximate proofs. This makes possible the development of an approximating sequent calculus for propositional deduction where proofs can be sound, complete or multi-directional approximations of classical logic. We show how this calculus subs...
متن کاملApproximations in Bayesian Belief Universe for Knowledge Based Systems
When expert systems based on causal probabilistic networks (CPNs) reach a certai n size and complex ity, the "combinatorial explosion monster" tends to be present. We propose an approximation scheme that identifies rarely occurring cases and excludes these from being processed as ordinary cases in a CPN-based expert system. Depending on the topology and the probability distributions of the CPN...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2006
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2006.01.007